搜索资源列表
sudoku1
- 数独求解代码，用深度优先搜索数独问题的解，求得唯一解-Solving Sudoku code, using depth-first search solution Sudoku problem, find a unique solution
SinaBlogFirstCollecting
- Sina博客爬虫,基于C#编写.实现功能是通过回帖发现新用户,然后按深度优先抓取各个用户的所有信息.需要SQL Server-Sina blog reptiles, based on the C# Prepared. The realization of function is to discover new users through the replies, and then by depth-first crawl all the information each user. The ne
src
- 商人过河问题是数学建模中的一个经典问题，程序利用链表存储渡河状态，使用穷举的算法实现。该算法会找出N个商人/随从渡河的一个可行方案，但并不保证是最佳方案。写完这个程序后让我想到的居然是图的深度优先搜索，二者在查找的思想上是类似的。-Merchants across the river mathematical modeling problem is a classic problem, the use of list storage procedures to cross the river,
8digits
- 人工智能，深度优先算法，VS2005做的，还能用-Artificial intelligence, depth-first algorithm, VS2005 do, but also with
graph
- 图的各种存储结构，特别要熟练掌握邻接矩阵和邻接表存储结构。 遍历是图各种应用的算法的基础，要熟练掌握图的深度优先遍历-Map a variety of storage structures, in particular to master the adjacency matrix and adjacency list storage structure. Graph traversal is a wide range of applications based on algorithms,
graph
- 数据结构C对图的操作算法，有广度、深度优先遍历，拓扑排序，最短路径的实现算法，最小生成树的算法-C data structures to operate on the map algorithm, there is the breadth, depth-first traversal, topological sorting, shortest path algorithm, minimum spanning tree algorithm
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
minop
- 最少运算问题 主要是深度优先搜索迭代加深的运用-At least the problem is that computing depth-first search Iterative deepening the use of
NQueen-WindowsVersion
- N皇后问题的解决办法.用深度优先搜索搜实现.-N Queen s problem solution. Used to achieve depth-first search found.
2
- 用邻接表表示的图的深度优先周游的非递归算法，邻接表的构造算法-Adjacency list with the plan said the depth-first tour of the non-recursive algorithm, adjacency list structure algorithm
f.doc
- 题目1：图的建立与遍历；连通网的最小生成树生成实现。 内容： 1） 用邻接表表示方法建立图1所示图的存储结构，用邻接矩阵存表示方法建立图2所示网的存储结构。 2） 在图1 存储结构（邻接表）上实现深度优先搜索遍历和广度优先搜索遍历，并给出遍历结果（序列）。 3） 按照普里姆算法，在图2所示连通网的存储结构（邻接矩阵）上实现此网的最小生成树，并输出生成树。 -Title 1: Map of the establishment and ergodicity conne
yuio
- * 函数功能: 深度优先遍历邻接链表表示的图 * 输入参数: Graph_A G 邻接链表表示的图 -* Function: depth-first traversal of the graph adjacency list that* input parameters: Graph_A G said adjacency list of graph
tu
- 图的深度优先遍历包括图的建立，分有向图和无向图-Graph depth-first traversal, including the establishment of plans, sub-directed graph and undirected graph
graph1
- 图的运算，有全图的无权图的广度深度优先遍历-Figure computing, there is no right to map the entire map of the breadth of depth-first traversal
lujingguihua
- 用深度优先算法做的一个路径规划。可以从开始点一直移动到目标点，避开障碍物。-Depth-first algorithm used to do a path planning. From the starting point has been moved to the target point, avoiding obstacles.
pso_pathplanning
- 粒子群(PSO)路径规划。这个是一个局部路径规划，用了深度优先搜索算法，可以走出“陷阱”。-Particle Swarm (PSO) path planning. This is a local path planning, with a depth-first search algorithm, we can get out a
Graph
- 本程序实现图的深度优先和广度优先遍历，本程序调试无误，可在vc6.0环境中编译成功！-This procedure to achieve graph depth-first and breadth-first traversal, the program debugging accurate, can be successfully compiled vc6.0 environment!
712
- 编写一个算法程序实现： 1、 用邻接表存储下图： 2、完成对以上图的深度优先搜索，设出发顶点是V1。 -Procedures for the preparation of an algorithm to achieve: 1, with adjacent storage under the map table: 2, completion of the above graph depth-first search, set the start
qiangLT
- 在强连通分支算法中，选择任何顶点做起始点来执行深度优先搜索遍历，得到的强连通分支的解相同。-In the strongly connected branching algorithm, choose any vertex make a starting point to implement the depth-first search traversal obtained strongly connected branch of the same solution.
hill
- 爬山算法是一种局部择优的方法，采用启发式方法，是对深度优先搜索的一种改进，它利用反馈信息帮助生成解的决策。 属于人工智能算法的一种。-Climbing algorithm is a partial merit-based approach, using heuristic methods, is a depth-first search of an improvement, which uses feedback information to generate solutions to help